A very fast simulated annealing method for inversion of magnetic anomaly over semi-infinite vertical rod-type structure

Very Fast Simulated Re-Annealing

Very fast Simulated Annealing for HW-SW partitioning

Hardware/software (HW-SW) partitioning is a key problem in the codesign of embedded systems and has been studied extensively in the past. With the wide availability of commercial platforms such as the Virtex-II Pro series from Xilinx that integrate processors with reconfigurable logic, one major existing challenge is the lack of efficient algorithms that can generate very high-quality solutions...

Application of very fast simulated annealing to the determination of the crustal structure beneath Tibet

The simulated annealing method has recently been applied to several multiparameter optimization problems, including those of geophysical inversion. A new variant of simulated annealing, called very fast simulated annealing (VFSA), overcomes some of the drawbacks of a conventional simulated annealing; it has been found to be a practical tool for geophysical inversion (Sen & Stoffa 1995). The met...

A Fast Algorithm for Simulated Annealing

We present a new deterministic algorithm for simulated annealing and demonstrate its applicability with several classical examples: the ground state energies of the 2d and 3d short range king spin glasses, the traveling salesman problem, and pattern recognition in computer vision. Our algorithm is based on a microcanonical Monte Carlo method and is shown to be a powerful tool for the analysis o...

Fast Simulated Re - Annealing

An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...